from math import *
def solve(l,r):
b = r // 2 + 1;
b = max(l, b)
return r % b;
n=int(input())
for i in range(n):
l,r=map(int,input().split(' '))
print(solve(l,r))#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
while (n --)
{
int a, b , mx;
cin >> a >> b;
mx = max (a , b / 2 + 1);
cout << b % mx << endl;
}
}
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |
Going to office | Color the boxes |